#include<iostream>
#include<cstring>
#include<vector>
#include<queue>

using namespace std;

const int N = 100010;
int h[N], e[N], ne[N], idx;
int d[N];
int n, m;

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}

void topsort()
{
    queue<int> q;
    for (int i = 1; i <= n; i++)
        if (!d[i])
            q.push(i);
    vector<int> res;
    while (q.size())
    {
        int t = q.front();
        q.pop();
        res.push_back(t);
        for (int i = h[t]; i != -1; i = ne[i])
        {
            int j = e[i];
            d[j]--;
            if (d[j] == 0)
                q.push(j);
        }
    }

    if (res.size() == n)
    {
        for (int i = 0; i < n; i++)
            cout << res[i] << " ";
        cout << endl;
    }
    else cout << -1 << endl;
}

int main()
{
    cin >> n >> m;
    int a, b;
    memset(h, -1, sizeof h);
    while (m--)
    {
        cin >> a >> b;
        add(a, b);
        d[b]++;
    }

    topsort();

    return 0;
}